The clustering coefficient and community structure of bipartite networks
نویسندگان
چکیده
Many real-world networks display a natural bipartite structure. It is necessary and important to study the bipartite networks by using the bipartite structure of the data. Here we propose a modification of the clustering coefficient given by the fraction of cycles with size four in bipartite networks. Then we compare the two definitions in a special graph, and the results show that the modification one is better to character the network. Next we define a edge-clustering coefficient of bipartite networks to detect the community structure in original bipartite networks. Keyword: Bipartite networks, Clustering coefficient, Community structure, Dissimilarity PACS: 89.75.Hc 05.40.-a 87.23.Kg
منابع مشابه
Measuring and modeling bipartite graphs with community structure
Network science is a powerful tool for analyzing complex systems in fields ranging from sociology to engineering to biology. This paper is focused on generative models of bipartite graphs, also known as twoway graphs. We propose two generative models that can be easily tuned to reproduce the characteristics of real-world networks, not just qualitatively, but quantitatively. The measurements we ...
متن کاملThe community Analysis of User Behaviors Network for Web Traffic
Understanding the structure and dynamics of the user behavior networks for web traffic (To be convenient in next sections, we refer to replace it as UBNWT) that connect users with servers across the Internet is a key to modeling the network and designing future application. The Web-visited bipartite networks, called the user behavioral networks, display a natural bipartite structure: two kinds ...
متن کاملFinding Community Base on Web Graph Clustering
Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کامل